Minimum concave cost multicommodity network design
نویسندگان
چکیده
منابع مشابه
On Minimum Concave Cost Network Flow Problems
Minimum concave Cost Network Flow Problems (MCNFPs) arise naturally in many practical applications such as communication, transportation, distribution, and manufacturing, due to economic considerations. In addition, it has been shown that every MCNFP with general nonlinear cost functions can be transformed into a concave MCNFP on an expanded network. It must also be noted, that multiple source ...
متن کاملMinimum cost capacity installation for multicommodity network flows
Consider a directed graph G = (V; A), and a set of traac demands to be shipped between pairs of nodes in V. Capacity has to be installed on the edges of this graph (in integer multiples of a base unit) so that traac can be routed. In this paper we consider the problem of minimum cost installation of capacity on the arcs to ensure that the required demands can be shipped simultaneously between n...
متن کاملHeuristic solutions for general concave minimum cost network flow problems
We address the single-source uncapacitated minimum cost network flow problem with general concave cost functions. Exact methods to solve this class of problems in their full generality are only able to address small to medium size instances, since this class of problems is known to be NP-Hard. Therefore, approximate methods are more suitable. In this work, we present a hybrid approach combining...
متن کاملMinimum concave cost flow over a grid network
The minimum concave cost network flow problem (MCCNFP) is NP-hard, but efficient polynomial-time algorithms exist for some special cases such as the uncapacitated lot-sizing problem and many of its variants. We study the MCCNFP over a grid network with a general nonnegative separable concave cost function. We show that this problem is polynomially solvable when all sources are in the first eche...
متن کاملUncertain minimum cost multicommodity flow problem
This paper investigates the minimum cost multicommodity flow problem with uncertain costs and uncertain capacities. Uncertainty theory is used to deal with indeterminacy factors in uncertain network. An (α, β)-minimum cost multicommodity flow model is formulated. Some properties of the model are analyzed. An equivalence relationship between the (α, β)-minimum cost multicommodity flow and the mi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Telecommunication Systems
سال: 2007
ISSN: 1018-4864,1572-9451
DOI: 10.1007/s11235-008-9068-2